Using Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem
نویسندگان
چکیده
The scheduling problem is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using meta-heuristics and intelligent algorithms. We present in this paper a solution to the scheduling problem using two different heuristics namely Simulated Annealing and Ant Colony Optimization. A study comparing the performances of both solutions is described and the results are analyzed.
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملThe Use of Metaheuristics to Software Project Scheduling Problem
This paper provides an overview of Software Project Scheduling problem as a combinatorial optimization problem. Since its inception by Alba, there have been multiple models to solve this problem. Metaheuristics provide high-level strategies capable of solving these problems efficiently. A set of metaheuristics used to solve this problem is presented, showing the resolution structure and its app...
متن کاملIdentical parallel machine scheduling with nonlinear deterioration and multiple rate modifying activities
Article History: Received 05 January 2017 Accepted 23 February 2017 Available 15 July 2017 This study focuses on identical parallel machine scheduling of jobs with deteriorating processing times and rate-modifying activities. We consider nonlinearly increasing processing times of jobs based on their position assignment. Rate modifying activities (RMAs) are also considered to recover the increas...
متن کاملSolving Open Shop Scheduling Problem with Two Criteria Using A New Optimization Method
This paper addresses the open shop scheduling problem. this problem, due to its complexity, is ranked in the class of NPhard problems. In this case, traditional approaches cannot reach to an optimal solution in a reasonable time. So heuristic algorithms such as simulated Annealing (SA), tabu search (TS) genetic algorithm, (GA), ant colony optimization (ACO) used to solve optimization problems s...
متن کاملA new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms
Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximi...
متن کامل